The Conjugacy Problem in Small Gaussian Groups
نویسنده
چکیده
Small Gaussian groups are a natural generalization of spherical Artin groups in which the existence of least common multiples is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be of Coxeter type. We show here how to extend the Elrifai-Morton solution for the conjugacy problem in braid groups to every small Gaussian group.
منابع مشابه
Algorithmic stratification of the conjugacy problem in Miller’s groups
We discuss the complexity of conjugacy problem in Miller’s groups. We stratify the groups in question and show that for “almost all”, in some explicit sense, elements, the conjugacy search problem is decidable in cubic time. It is worth noting that a Miller’a group may have undecidable conjugacy search problem; our results show that “hard” instances of the problem comprise a negligibly small pa...
متن کاملGeneric Complexity of the Conjugacy Problem in HNN-Extensions and Algorithmic Stratification of Miller's Groups
We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller’s groups. We show that for “almost all”, in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is worth noting that the Conjugacy Problem in a Miller group may have be undecidable. Our results show that “hard” instances of the problem comprise a negligibly s...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملComputational determination of character table and symmetry of fullerenes cage as C24 and C28
Fullerene chemistry is nowadays a well-established field of both theoretical and experimental investigations. This study considers the symmetry of small fullerenes cage C24 and C28. Using PM3 program for C24 and C28 fullerenes, Oh and Td symmetry were confirmed, respectively. The mentioned algorithm to compute the automorphism group of these fullerenes with connectivity and geometry of th...
متن کاملOn the Regular Power Graph on the Conjugacy Classes of Finite Groups
emph{The (undirected) power graph on the conjugacy classes} $mathcal{P_C}(G)$ of a group $G$ is a simple graph in which the vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C'$ are adjacent in $mathcal{P_C}(G)$ if one is a subset of a power of the other. In this paper, we describe groups whose associated graphs are $k$-regular for $k=5,6$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000